Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps
نویسندگان
چکیده
منابع مشابه
Permutations with forbidden subsequences and nonseparable planar maps
The goal of the present work is to connect combinatorially a family of maps to a family of permutations with forbidden subsequences. We obtain a generating tree of nonseparable planar rooted maps and show that this tree is the generating tree of a family of permutations. The distribution of these permutations is then obtained. Finally, the different steps leading to the combinatorial proof of W...
متن کاملAlternating Permutations with Restrictions and Standard Young Tableaux
Abstract. In this paper, we establish bijections between the set of 4123-avoiding In this paper, we establish bijections between the set of 4123-avoiding down-up alternating permutations of length 2n and the set of standard Young tableaux of shape (n, n, n), and between the set of 4123-avoiding down-up alternating permutations of length 2n−1 and the set of shifted standard Young tableaux of sha...
متن کاملPosets of Matrices and Permutations with Forbidden Subsequences
The enumeration of permutations with specific forbidden subsequences has applications in areas ranging from algebraic geometry to the study of sorting algorithms. We consider a ranked poset of permutation matrices whose global structure incorporates the solution to the equivalent problem of enumerating permutations which contain a required subsequence. We describe this structure completely for ...
متن کاملSome permutations with forbidden subsequences and their inversion number
A permutation avoids the subpattern i3 has no subsequence having all the same pairwise comparisons as , and we write ∈ S( ). We examine the classes of permutations, S(321); S(321; 37 142) and S(4231; 4132), enumerated, respectively by the famous Catalan, Motzkin and Schr; oder number sequences. We determine their generating functions according to their length, number of active sites and inversi...
متن کاملStirling numbers interpolation using permutations with forbidden subsequences
We present a family of number sequences which interpolates between the sequences Bn, of Bell numbers, and n!. It is de ned in terms of permutations with forbidden patterns or subsequences. The introduction, as a parameter, of the number m of right{to{left minima yields an interpolation between Stirling numbers of the second kind S(n;m) and of the rst kind (signless) c(n;m). Moreover, q-counting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00121-1